Multiobjective optimal allocation problem with probabilistic non-linear cost constraint
نویسندگان
چکیده
منابع مشابه
Optimal portfolio allocation with imposed price limit constraint
Daily price limits are adopted by many securities exchanges in countries such as the USA, Canada, Japan and various other countries in Europe and Asia, in order to increase the stability of the financial market. These limits confine the price of the financial asset during all trading stages of any trading day to a range, usually determined based on the previous day’s closing price. In this pape...
متن کاملOptimal Computing Cost Budget Allocation For Solving Buffer Allocation Problem
In this paper, we study the problem of selecting a system that has the best performance or selecting one of the best systems when the objective function is the expected performance of a complex stochastic system. The focus here is on a huge size but finite feasible solution set, that is not necessarily well structured. We consider the use of the ordinal optimization technique that concerns with...
متن کاملSolving a multicommodity location-allocation problem with non linear costs
This paper deals with a planning problem arising in large logistics companies. The problem consists in defining the optimal number of depots, their location, and their size as well as the routing decisions. Economies of scale are present both in the transportation and in the depots operations. The paper proposes an exact algorithm and an efficient heuristic based on the integration of tabu sear...
متن کاملOptimal Stopping with a Probabilistic Constraint
We present an efficient method for solving optimal stopping problems with a probabilistic constraint. The goal is to optimize the expected cumulative cost, but constrained by an upper bound on the probability that the cost exceeds a specified threshold. This probabilistic constraint causes optimal policies to be time-dependent and randomized, however, we show that an optimal policy can always b...
متن کاملSolving Multiobjective Optimization Problem by Constraint Optimization
Multiobjective optimization problems (MOPs) have attracted intensive efforts from AI community and many multiobjective evolutionary algorithms (MOEAs) were proposed to tackle MOPs. In addition, a few researchers exploited MOEAs to solve constraint optimization problems (COPs). In this paper, we investigate how to tackle a MOP by iteratively solving a series of COPs and propose the algorithm nam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering, Science and Technology
سال: 1970
ISSN: 2141-2839,2141-2820
DOI: 10.4314/ijest.v3i6.11